Two-category model of task allocation with application to ant societies.

نویسندگان

  • W A Brandts
  • A Longtin
  • L E Trainor
چکیده

In many network models of interacting units such as cells or insects, the coupling coefficients between units are independent of the state of the units. Here we analyze the temporal behavior of units that can switch between two 'category' states according to rules that involve category-dependent coupling coefficients. The behaviors of the category populations resulting from the asynchronous random updating of units are first classified according to the signs of the coupling coefficients using numerical simulations. They range from isolated fixed points to lines of fixed points and stochastic attractors. These behaviors are then explained analytically using iterated function systems and birth-death jump processes. The main inspiration for our work comes from studies of non-hierarchical task allocation in, e.g., harvester ant colonies where temporal fluctuations in the numbers of ants engaged in various tasks occur as circumstances require and depend on interactions between ants. We identify interaction types that produce quick recovery from perturbations to an asymptotic behavior whose characteristics are function of the coupling coefficients between ants as well as between ants and their environment. We also compute analytically the probability density of the population numbers, and show that perturbations in our model decay twice as fast as in a model with random switching dynamics. A subset of the interaction types between ants yields intrinsic stochastic asymptotic behaviors which could account for some of the experimentally observed fluctuations. Such noisy trajectories are shown to be random walks with state-dependent biases in the 'category population' phase space. With an external stimulus, the parameters of the category-switching rules become time-dependent. Depending on the growth rate of the stimulus in comparison to its population-dependent decay rate, the dynamics may qualitatively differ from the case without stimulus. Our simple two-category model provides a framework for understanding the rich variety of behaviors in network dynamics with state-dependent coupling coefficients, and especially in task allocation processes with many tasks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolutionary Optimization of Societies in Simulated Multi-Agent Systems

In this paper we show how to use evolutionary optimization in multi-agent systems with simple, non deliberative agents to evolve successful interaction in societies, mostly for task allocation based problems. The presented generic optimization scheme – which is implemented based on the multi-agent simulation tool SeSAm – was used to model prehistoric ant species. The idea was to show how solita...

متن کامل

Multi-robot Task Allocation Based on Ant Colony Algorithm

With the development of information technology, the capability and application fields of robots become wider. In order to complete a complex task, the cooperation and coordination of robots are needed to be adopted. As the main problem of the multi-robot systems, multi-robot task allocation (MRTA) reflects the organization form and operation mechanism of the robots system. The cooperation and a...

متن کامل

Healthcare Districting Optimization Using Gray Wolf Optimizer and Ant Lion Optimizer Algorithms (case study: South Khorasan Healthcare System in Iran)

In this paper, the problem of population districting in the health system of South Khorasan province has been investigated in the form of an optimization problem. Now that the districting problem is considered as a strategic matter, it is vital to obtain efficient solutions in order to implement in the system. Therefore in this study two meta-heuristic algorithms, Ant Lion Optimizer (ALO) and G...

متن کامل

A Non-dominated Sorting Ant Colony Optimization Algorithm Approach to the Bi-objective Multi-vehicle Allocation of Customers to Distribution Centers

Distribution centers (DCs) play important role in maintaining the uninterrupted flow of goods and materials between the manufacturers and their customers.This paper proposes a mathematical model as the bi-objective capacitated multi-vehicle allocation of customers to distribution centers. An evolutionary algorithm named non-dominated sorting ant colony optimization (NSACO) is used as the optimi...

متن کامل

eXtreme-Ants: Ant Based Algorithm for Task Allocation in Extreme Teams

This paper addresses the problem of multiagent task allocation in extreme teams. An extreme team is composed by a large number of agents with overlapping functionality operating in dynamic environments with possible inter-task constraints. We present an approximate algorithm for task allocation in extreme teams, called eXtreme-Ants. The algorithm is inspired in the division of labor in social i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Bulletin of mathematical biology

دوره 63 6  شماره 

صفحات  -

تاریخ انتشار 2001